Generating Modular Grammar Exercises with Finite-State Transducers
نویسندگان
چکیده
This paper presents an ICALL system for learning complex inflection systems, based upon finite state transducers (FST). Using a FST has several advantages: it makes it possible to generate a virtually unlimited set of exercises with a relatively small amount of work, and it makes it possible to process both input and output according to a wide range of parameters, such as dialect variation, and varying writing conventions. It also makes it possible to anticipate common error types, and give precise feedback both on errors and possible corrections. It shifts the developer’s focus from form generation and over to a pedagogically-motivated modelling of the learning task. The system is in active use on the web for two Saami languages, but can be made to work for any inflectional language.
منابع مشابه
Constraint Grammar Parsing with Left and Right Sequential Finite Transducers
We propose an approach to parsing Constraint Grammars using finite-state transducers and report on a compiler that converts Constraint Grammar rules into transducer representations. The resulting transducers are further optimized by conversion to left and right sequential transducers. Using the method, we show that we can improve on the worstcase asymptotic bound of Constraint Grammar parsing f...
متن کاملUsing context-free grammars for embedded speech recognition with Weighted Finite-State Transducers
In this paper we propose an extension to weighted finite-state transducers in order to enable them to model context-free grammars. Classical finite-state transducers are restricted to modeling regular grammars. However, for some tasks it is necessary to use more general context-free grammars. Even some regular grammar models can be scaled down using context-free rules. The paper extents the tra...
متن کاملFinite State Transducers for Modular Möbius Number Systems
Modular Möbius number systems consist of Möbius transformations with integer coefficients and unit determinant. We show that in any modular Möbius number system, the computation of a Möbius transformation with integer coefficients can be performed by a finite state transducer and has linear time complexity. As a byproduct we show that every modular Möbius number system has the expansion subshif...
متن کاملSynCoP – Combining Syntactic Tagging with Chunking Using Weighted Finite State Transducers
This paper describes the key aspects of the system SynCoP (Syntactic Constraint Parser) developed at the Berlin-Brandenburgische Akademie der Wissenschaften. The parser allows to combine syntactic tagging and chunking by means of constraint grammar using weighted finite state transducers (WFST). Chunks are interpreted as local dependency structures within syntactic tagging. The linguistic theor...
متن کاملMachine Translation with Inferred Stochastic Finite-State Transducers
Finite-state transducers are models that are being used in different areas of pattern recognition and computational linguistics. One of these areas is machine translation, in which the approaches that are based on building models automatically from training examples are becoming more and more attractive. Finite-state transducers are very adequate for use in constrained tasks in which training s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013